The projection method for continuous-time consensus seeking
نویسندگان
چکیده
For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show that consensus can be achieved by employing the method of orthogonal projection, which has been proposed for the discrete-time coordination problem.
منابع مشابه
Novel consensus quantitative structure-retention relationship method in prediction of pesticides retention time in nano-LC
In this study, quantitative structure-retention relationship (QSRR) methodology employed for modeling of the retention times of 16 banned pesticides in nano-liquid chromatography (nano-LC) column. Genetic algorithm-multiple linear regression (GA-MLR) method employed for developing global and consensus QSRR models. The best global GA-MLR model was established by adjusting GA parameters. Three de...
متن کاملConsensus Seeking in Multi-agent Systems
This note considers the problem of information consensus among multiple agents in the presence of limited and unreliable information exchange with dynamically changing interaction topologies. Both discrete and continuous update schemes are proposed for information consensus. The note shows that information consensus under dynamically changing interaction topologies can be achieved asymptoticall...
متن کاملAdaptive Consensus Control for a Class of Non-affine MIMO Strict-Feedback Multi-Agent Systems with Time Delay
In this paper, the design of a distributed adaptive controller for a class of unknown non-affine MIMO strict-feedback multi agent systems with time delay has been performed under a directed graph. The controller design is based on dynamic surface control method. In the design process, radial basis function neural networks (RBFNNs) were employed to approximate the unknown nonlinear functions. S...
متن کاملOptimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics
In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...
متن کاملA model based, anatomy dependent method for ultra-fast creation of primary SPECT projections
Introduction: Monte Carlo (MC) is the most common method for simulating virtual SPECT projections. It is useful for optimizing procedures, evaluating correction algorithms and more recently image reconstruction as a forward projector in iterative algorithms; however, the main drawback of MC is its long run time. We introduced a model based method considering the eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1507.04177 شماره
صفحات -
تاریخ انتشار 2015